Big O notation
Asymptotically optimal algorithm: A phrase frequently used to describe an algorithm that has an upper bound asymptotically within a constant of a lower bound for the problem Master theorem (analysis of algorithms): For analyzing divide-and-conquer recursive algorithms using Big O notation Nachbin's theorem: A precise method of bounding complex analytic functions so that the domain of convergence of integral transforms can be stated